Spherical Harmonic Transform Algorithms
نویسندگان
چکیده
A collection of MATLAB classes for computing and using spherical harmonic transforms is presented. Methods of these classes compute differential operators on the sphere and are used to solve simple partial differential equations in a spherical geometry. The spectral synthesis and analysis algorithms using fast Fourier transforms and Legendre transforms with the associated Legendre functions are presented in detail. A set of methods associated with a spectral field class provides spectral approximation to the differential operators ∇·, ∇×, ∇, and ∇2 in spherical geometry. Laplace inversion and Helmholtz equation solvers are also methods for this class. The use of the class and methods in MATLAB are demonstrated by the solution of the barotropic vorticity equation on the sphere. A survey of alternative algorithms is given and implementations for parallel high performance computers are discussed in the context of global climate and weather models.
منابع مشابه
Fast, exact (but unstable) spin spherical harmonic transforms
We derive algorithms to perform a spin spherical harmonic transform and inverse for functions of arbitrary spin number. These algorithms involve recasting the spin transform on the two-sphere S as a Fourier transform on the two-torus T. Fast Fourier transforms are then used to compute Fourier coefficients, which are related to spherical harmonic coefficients through a linear transform. By recas...
متن کاملFast Algorithms for Spherical Harmonic Expansions
An algorithm is introduced for the rapid evaluation at appropriately chosen nodes on the two-dimensional sphere S2 in R3 of functions specified by their spherical harmonic expansions (known as the inverse spherical harmonic transform), and for the evaluation of the coefficients in spherical harmonic expansions of functions specified by their values at appropriately chosen points on S2 (known as...
متن کاملFast algorithms for spherical harmonic expansions, II
We provide an efficient algorithm for calculating, at appropriately chosen points on the two-dimensional surface of the unit sphere in R, the values of functions that are specified by their spherical harmonic expansions (a procedure known as the inverse spherical harmonic transform). We also provide an efficient algorithm for calculating the coefficients in the spherical harmonic expansions of ...
متن کاملFast Spherical Harmonic Transform Algorithm based on Generalized Fast Multipole Method
Spherical harmonic transform is the most important orthogonal function transform only except Fourier transform, and is used not only for climate simulation and signal processing but also for a base of several numerical algorithms. Fast Fourier Transform (FFT), which runs in time O(N logN) is quite well known, but, for spherical harmonic transform, there is no fast algorithm which is as simple a...
متن کاملA Fast Transform for Spherical Harmonics
Spherical Harmonics arise on the sphere S in the same way that the (Fourier) exponential functions {e}k∈Z arise on the circle. Spherical Harmonic series have many of the same wonderful properties as Fourier series, but have lacked one important thing: a numerically stable fast transform analogous to the Fast Fourier Transform. Without a fast transform, evaluating (or expanding in) Spherical Har...
متن کامل